Parallel solution of toeplitzlike linear systems
نویسندگان
چکیده
منابع مشابه
Parallel Solution of Space Linear Systems
Many simulations in science and engineering give rise to sparse linear systems of equations. It is a well known fact that the cost of the simulation process is almost always governed by the solution of the linear systems especially for largescale problems. The emergence of extreme-scale parallel platforms, along with the increasing number of processing cores available on a single chip pose sign...
متن کاملMinimal solution of fuzzy linear systems
In this paper, we use parametric form of fuzzy number and we converta fuzzy linear system to two linear system in crisp case. Conditions for the existence of a minimal solution to $mtimes n$ fuzzy linear equation systems are derived and a numerical procedure for calculating the minimal solution is designed. Numerical examples are presented to illustrate the proposed method.
متن کاملA parallel solution to linear systems
Streaming SIMD Extensions (SSE) is a unique feature embedded in the Pentium III and IV classes of microprocessors. By fully exploiting SSE, parallel algorithms can be implemented on a standard personal computer and a theoretical speedup of four can be achieved. In this paper, we demonstrate the implementation of a parallel LU matrix decomposition algorithm for solving linear systems with SSE an...
متن کاملThe Parallel Solution of Triangular Systems of Linear Equations
We present a parallel algorithm for solving triangular systems of linear equations on distributed-memory multiprocessor machines. The parallelism is achieved by partitioning the rows of the coefficient matrix in segments of a fixed size and distributing these sets in a wrap-around fashion among the processors, connected in a ring. The granularity of the algorithm is controlled by varying the se...
متن کاملProcessor Efficient Parallel Solution of Linear Systems of Equations
We present a deterministic parallel algorithm that solves a n-dimensional system Ax b of linear equations over an ordered field or over a subfield of the complex Ž 2 . Ž Ž . 2 numbers. This algorithm uses O log n parallel time and O max M n , n Ž . 4. Ž . log log n log n arithmetic processors if M n is the processor complexity of fast parallel matrix multiplication. 2000 Academic Press
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1992
ISSN: 0885-064X
DOI: 10.1016/0885-064x(92)90031-6